Clustered Elias-Fano Indexes

Dynamic Elias-Fano Representation

We show that it is possible to store a dynamic ordered set S(n, u) of n integers drawn from a bounded universe of size u in space close to the information-theoretic lower bound and yet preserve the asymptotic time optimality of the operations. Our results leverage on the EliasFano representation of S(n, u) which takes EF(S(n, u)) = ndlog u ne+ 2n bits of space and can be shown to be less than h...

Learning Succinct Models: Pipelined Compression with L1-Regularization, Hashing, Elias-Fano Indices, and Quantization

The recent proliferation of smart devices necessitates methods to learn small-sized models. This paper demonstrates that if there arem features in total but only n = o( √ m) features are required to distinguish examples, with Ω(logm) training examples and reasonable settings, it is possible to obtain a goodmodel in a succinct representation using n log2 m n+o(m) bits, by using a pipeline of exi...

Elias George Hall

3 Elias-bassalygo Theorem

Problem Set 1 is due next Wednesday. 2 Overview Today we will do the following. • Prove the Elias-Bassalygo-Johnson Bound introduced in the previous lecture. Recall that the proof consists of the two lemmas described roughly below – List decodable codes have poor rate. – Good error correcting codes are nicely decodable. • Introduce some algebraic codes along with some helpful idea from algebra....

Elias Phocas MD (1930-2012)

We recently said our last goodbye to Elias Phocas, a distinguished gastroenterologist, teacher and friend. He faithfully and selflessly served Hellenic Gastroenterology for decades in a wide array of positions, including the Presidency of the Hellenic Society of Gastroenterology, and Presidency of the Panhellenic Gastroenterology Congress. The manner in which Elias practiced gastroenterology se...